A New Population-Based Method for Satisfiability Problems
نویسندگان
چکیده
This paper presents the mask method (MASK), a new population-based, evolutionary search procedure for nd-ing models for satissability problems (SAT). In this method, a partial truth assignment for a given boolean expression containing N variables is represented by a partially instantiated 0/1 string with N positions (called mask), with each position coding one variable. The mask method begins with a population of masks. An iteration process follows to evaluate each mask in the population using an evaluation mechanism, then to discard half of them, and nally to divide each remaining mask into two new ones by xing a free position in the mask to 0 and 1 respectively. This process continues until all the positions in the mask have a xed value. The method is compared with a class of genetic algorithms (GAs) on a set of SAT instances and proves to be much more eecient.
منابع مشابه
Introducing a new meta-heuristic algorithm based on See-See Partridge Chicks Optimization to solve dynamic optimization problems
The SSPCO (See-See Particle Chicks Optimization) is a type of swarm intelligence algorithm derived from the behavior of See-See Partridge. Although efficiency of this algorithm has been proven for solving static optimization problems, it has not yet been tested to solve dynamic optimization problems. Due to the nature of NP-Hard dynamic problems, this algorithm alone is not able to solve such o...
متن کاملNew Ant Colony Algorithm Method based on Mutation for FPGA Placement Problem
Many real world problems can be modelled as an optimization problem. Evolutionary algorithms are used to solve these problems. Ant colony algorithm is a class of evolutionary algorithms that have been inspired of some specific ants looking for food in the nature. These ants leave trail pheromone on the ground to mark good ways that can be followed by other members of the group. Ant colony optim...
متن کاملA Framework for Adapting Population-Based and Heuristic Algorithms for Dynamic Optimization Problems
In this paper, a general framework was presented to boost heuristic optimization algorithms based on swarm intelligence from static to dynamic environments. Regarding the problems of dynamic optimization as opposed to static environments, evaluation function or constraints change in the time and hence place of optimization. The subject matter of the framework is based on the variability of the ...
متن کاملSolving Incremental Satisfiability
Propositional satisfiability (SAT) problem is fundamental to the theory of NPcompleteness. Indeed, using the concept of ”polynomial-time reducibility” all NPcomplete problems can be polynomially reduced to SAT. Thus, any new technique for satisfiability problems will lead to general approaches for thousands of hard combinatorial problems. In this paper, we introduce the incremental propositiona...
متن کاملA population-based algorithm for the railroad blocking problem
Railroad blocking problem (RBP) is one of the problems that need an important decision in freight railroads. The objective of solving this problem is to minimize the costs of delivering all commodities by deciding which inter-terminal blocks to build and by specifying the assignment of commodities to these blocks, while observing limits on the number and cumulative volume of the blocks assemble...
متن کامل